Hierarchical Combination
Identifieur interne : 001578 ( Main/Exploration ); précédent : 001577; suivant : 001579Hierarchical Combination
Auteurs : Serdar Erbatur [Italie] ; Deepak Kapur [États-Unis] ; Andrew M. Marshall [États-Unis] ; Paliath Narendran [États-Unis] ; Christophe Ringeissen [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A novel approach is described for the combination of unification algorithms for two equational theories E 1 and E 2 which share function symbols. We are able to identify a set of restrictions and a combination method such that if the restrictions are satisfied the method produces a unification algorithm for the union of non-disjoint equational theories. Furthermore, we identify a class of theories satisfying the restrictions. The critical characteristics of the class is the hierarchical organization and the shared symbols being restricted to “inner constructors”.
Url:
DOI: 10.1007/978-3-642-38574-2_17
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000782
- to stream Istex, to step Curation: 000777
- to stream Istex, to step Checkpoint: 000204
- to stream Hal, to step Corpus: 002776
- to stream Hal, to step Curation: 002776
- to stream Hal, to step Checkpoint: 001091
- to stream Main, to step Merge: 001590
- to stream Main, to step Curation: 001578
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Hierarchical Combination</title><author><name sortKey="Erbatur, Serdar" sort="Erbatur, Serdar" uniqKey="Erbatur S" first="Serdar" last="Erbatur">Serdar Erbatur</name></author><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></author><author><name sortKey="Marshall, Andrew M" sort="Marshall, Andrew M" uniqKey="Marshall A" first="Andrew M." last="Marshall">Andrew M. Marshall</name></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:22BEBF4D5A5A70628A99C8DEE37540BE92C43C48</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-38574-2_17</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-W81B89SD-5/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000782</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000782</idno><idno type="wicri:Area/Istex/Curation">000777</idno><idno type="wicri:Area/Istex/Checkpoint">000204</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000204</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00878649</idno><idno type="url">https://hal.inria.fr/hal-00878649</idno><idno type="wicri:Area/Hal/Corpus">002776</idno><idno type="wicri:Area/Hal/Curation">002776</idno><idno type="wicri:Area/Hal/Checkpoint">001091</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001091</idno><idno type="wicri:Area/Main/Merge">001590</idno><idno type="wicri:Area/Main/Curation">001578</idno><idno type="wicri:Area/Main/Exploration">001578</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Hierarchical Combination</title><author><name sortKey="Erbatur, Serdar" sort="Erbatur, Serdar" uniqKey="Erbatur S" first="Serdar" last="Erbatur">Serdar Erbatur</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Dipartimento di Informatica, Università degli Studi di Verona</wicri:regionArea><wicri:noRegion>Università degli Studi di Verona</wicri:noRegion></affiliation></author><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University of New Mexico</wicri:regionArea></affiliation></author><author><name sortKey="Marshall, Andrew M" sort="Marshall, Andrew M" uniqKey="Marshall A" first="Andrew M." last="Marshall">Andrew M. Marshall</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Naval Research Laboratory</wicri:regionArea></affiliation></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University at Albany, SUNY</wicri:regionArea><wicri:noRegion>SUNY</wicri:noRegion></affiliation></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LORIA – INRIA Nancy-Grand Est</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A novel approach is described for the combination of unification algorithms for two equational theories E 1 and E 2 which share function symbols. We are able to identify a set of restrictions and a combination method such that if the restrictions are satisfied the method produces a unification algorithm for the union of non-disjoint equational theories. Furthermore, we identify a class of theories satisfying the restrictions. The critical characteristics of the class is the hierarchical organization and the shared symbols being restricted to “inner constructors”.</div></front></TEI><affiliations><list><country><li>France</li><li>Italie</li><li>États-Unis</li></country></list><tree><country name="Italie"><noRegion><name sortKey="Erbatur, Serdar" sort="Erbatur, Serdar" uniqKey="Erbatur S" first="Serdar" last="Erbatur">Serdar Erbatur</name></noRegion></country><country name="États-Unis"><noRegion><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></noRegion><name sortKey="Marshall, Andrew M" sort="Marshall, Andrew M" uniqKey="Marshall A" first="Andrew M." last="Marshall">Andrew M. Marshall</name><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></country><country name="France"><noRegion><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001578 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001578 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:22BEBF4D5A5A70628A99C8DEE37540BE92C43C48
|texte= Hierarchical Combination
}}
| This area was generated with Dilib version V0.6.33. |  |